Blind Ldpc Encoder Identification
نویسندگان
چکیده
Nowadays, adaptive modulation and coding (AMC) techniques can facilitate flexible strategies subject to dynamic channel quality. The AMC transceivers select the most suitable coding and modulation mechanisms subject to the acquired channel information. Meanwhile, a control channel or a preamble is usually required to synchronously coordinate such changes between transmitters and receivers. On the other hand, low-density parity-check (LDPC) codes become more and more popular in recent years due to their promising capacityapproaching property. The broad range of variations in code rates and codeword lengths for LDPC codes makes them ideal candidates for future AMC transceivers. The blind encoder identification problem emerges when the underlying control channel is absent or the preamble is not allowed in AMC systems. It would be quite intriguing for one to build a blind encoder identification technique without spectrum-efficiency sacrifice. Therefore, in this thesis, we investigate blind LDPC encoder identification for AMC systems. Specifically, we would like to tackle the blind identification of binary LDPC codes (encoders) for binary phase-shift keying (BPSK) signals and nonbinary LDPC codes for quadratureamplitude modulation (QAM) signals. We propose a novel blind identification system which consists of three major components, namely expectation-maximization (EM) estimator for unknown parameters (signal amplitude, noise variance, and phase offset), log-likelihood ratio (LLR) estimator for syndrome a posteriori probabilities, and maximum average-LLR detector. Monte Carlo simulation results demonstrate that our proposed blind LDPC encoder identification scheme is very promising over different signal-to-noise ratio conditions.
منابع مشابه
BLIND PARAMETER ESTIMATION OF A RATE k/n CONVOLUTIONAL CODE IN NOISELESS CASE
This paper concerns to blind identification of a convolutional code with desired rate in a noiseless transmission scenario. To the best of our knowledge, blind estimation of convolutional code based on only the received bitstream doesn’t lead to a unique solution. Hence, without loss of generality, we will assume that the transmitter employs a non-catastrophic encoder. Moreover, we consider a c...
متن کاملDirty-Paper Writing Based on LDPC Codes for Data Hiding
We describe a new binning technic for informed data hiding problem. In information theoretical point of view, the blind watermarking problem can be seen as transmitting a secret message M through a noisy channel on top of an interfered host signal S that is available only at the encoder. We propose an embedding scheme based on Low Density Parity Check(LDPC) codes, in order to quantize the host ...
متن کاملLDPC Generation and New Decoding Process based on Convolutional Encoder
In this paper, we suggest a new technique for LDPC parity-check matrix (H-matrix) generation and a corresponding decoding process. The key idea is to construct LDPC H-matrix by using a convolutional encoder. It is easy to have many different coderates from a mother code with convolutional codes. However, it is difficult to have many different coderates with LDPC codes. Constructing LDPC Hmatrix...
متن کاملReduced Complexity Quasi-cyclic Ldpc Encoder for Ieee 802.11n
In this paper, we present a low complexity Quasi-cyclic -low-density-parity-check (QC-LDPC) encoder hardware based on Richardson and Urbanke lowertriangular algorithm for IEEE 802.11n wireless LAN Standard for 648 block length and 1/2 code rate. The LDPC encoder hardware implementation works at 301.433MHz and it can process 12.12 Gbps throughput. We apply the concept of multiplication by consta...
متن کاملA Memory Efficient -Fully Parallel QC-LDPC Encoder
Low-Density Parity Check codes are a special class of linear block codes widely used in communication and disk storage systems, due to their Shannon limit approaching performance and their favourable structure. A special class of LDPC codes, called QC-LDPC codes, allows for efficient hardware implementations of encoding and decoding algorithms by exploiting the structure of the Parity Check Mat...
متن کامل